A Note on the Constructions of Orthomorphic Permutations
نویسنده
چکیده
Orthomorphic permutations have important applications in the design of block ciphers. A practical algorithm is derived to generate all orthomorphic permutations over F 2 , and it is verified that the number of all orthomorphic permutations over F 4 2 is 244,744,192. With the theory of finite fields, a brief method is derived to generate a permutation polynomial corresponding to every permutation over F 2 , and all orthomorphic permutation polynomials over F 4 2 are analyzed.
منابع مشابه
Loiss: A Byte-Oriented Stream Cipher
This paper presents a byte-oriented stream cipher – Loiss, which takes a 128-bit initial key and a 128-bit initial vector as inputs, and outputs a key stream of bytes. The algorithm is based on a linear feedback shift register, and uses a structure called BOMM in the filter generator, which has good property on resisting against algebraic attacks, linear distinguishing attacks and fast correlat...
متن کاملThe Properties of Orthomorphisms on the Galois Field
The orthomorphism on the Galois field is a kind of permutations that is the most widely used in crosscutting issue, the orthomorphic polynomials over the finite field is an effective method to study it, this study has obtained the coefficients relationship of the orthomorphisms over the Galois field by algebraic methods. In addition, this study have understood the maximal subgroup structure and...
متن کاملA note on constructions of bent functions from involutions
Bent functions are maximally nonlinear Boolean functions. They are important functions introduced by Rothaus and studied firstly by Dillon and next by many researchers for four decades. Since the complete classification of bent functions seems elusive, many researchers turn to design constructions of bent functions. In this note, we show that linear involutions (which are an important class of ...
متن کاملA Stream Cipher Based on Chaotic Permutations
In this paper we introduce a word-based stream cipher consisting of a chaotic part operating as a chaotic permutation and a linear part, both of which designed on a finite field. We will show that this system can operate in both synchronized and self-synchronized modes. More specifically, we show that in the self-synchronized mode the stream cipher has a receiver operating as an unknown input o...
متن کاملA Novel Intrusion Detection Systems based on Genetic Algorithms-suggested Features by the Means of Different Permutations of Labels’ Orders
Intrusion detection systems (IDS) by exploiting Machine learning techniques are able to diagnose attack traffics behaviors. Because of relatively large numbers of features in IDS standard benchmark dataset, like KDD CUP 99 and NSL_KDD, features selection methods play an important role. Optimization algorithms like Genetic algorithms (GA) are capable of finding near-optimum combination of the fe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- I. J. Network Security
دوره 10 شماره
صفحات -
تاریخ انتشار 2010